Constructive consistency checking for partial

نویسندگان

  • Eerke Boiten
  • John Derrick
  • Howard Bowman
  • Maarten Steen
چکیده

If you believe this document infringes copyright then please contact the KAR admin team with the take-down information provided at http://kar.kent.ac.uk/contact.html Citation for published version Boiten, Eerke Albert and Derrick, John and Bowman, Howard and Steen, Maarten (1999) Constructive consistency checking for partial specification in Z. Science of Computer Programming, 35 (1). pp. 29-75. ISSN 0167-6423.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Incorporating Constructive Tools into a Generic Language-based Editor Incorporating Constructive Tools into a Generic Language-based Editor

As a uniform front-end user interface, a generic language-based editor should have the capability to incorporate both analytic and constructive back-end tools. In this paper , we analyse the requirements of, and propose a strategy for, integrating constructive tools into a generic language-based editor. The major issues addressed include deenition of software documents containing tool contribut...

متن کامل

Systematic Construction of Abstractions for Model-Checking

This paper describes a framework, based on Abstract Interpretation, for creating abstractions for model-checking. Specifically, we study how to abstract models of calculus and systematically derive abstractions that are constructive, sound, and precise, and apply them to abstracting Kripke structures. The overall approach is based on the use of bilattices to represent partial and inconsistent i...

متن کامل

Directed Arc Consistency Preprocessing as a Strategy for Maximal Constraint Satisfaction

1 ABSTRACT A constraint satisfaction problem (CSP) may be overcon-strained and not admit a complete solution. Optimal solutions to such partial constraint satisfaction problems (PCSPs), in which a maximum number of constraints are satissed, can be found using branch and bound variants of CSP algorithms. Earlier work has shown how information gained through local consistency checking during prep...

متن کامل

Dynamic Consistency Checking in Goal-Directed Answer Set Programming

In answer set programming, inconsistencies arise when the constraints placed on a program become unsatisfiable. In this paper, we introduce a technique for dynamic consistency checking for our goal-directed method for computing answer sets, under which only those constraints deemed relevant to the partial answer set are tested, allowing inconsistent knowledgebases to be successfully queried. Ho...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009